Statistical Multiplexing Gain Analysis of Processing Resources in Centralized Radio Access Networks
نویسندگان
چکیده
منابع مشابه
Statistical Multiplexing Gain of Link Scheduling Algorithms in QoS Networks
A statistical network service which allows a certain fraction of tra c to not meet its QoS guarantees can extract additional capacity from a network by exploiting statistical properties of tra c. Here we consider a statistical service which assumes statistical independence of ows, but does not make any assumptions on the statistics of tra c sources, other than that they are regulated, e.g., by ...
متن کاملMassive MIMO operation in partially centralized cloud radio access networks
Massive multiple-input multiple-output (MIMO) is considered as one of the key technologies in next generation cellular systems due to its higher multiplexing gain and energy efficiency. However, in a cloud radio access network (C-RAN) with massive MIMO, operation of many antennas incurs a huge amount of digital sampled data to be transported over the fronthaul link between a baseband unit (BBU)...
متن کاملThe Complexity-Rate Tradeoff of Centralized Radio Access Networks
In a centralized radio access network (RAN), the signals from multiple radio access points (RAPs) are processed centrally in a data center. Centralized RAN enables advanced interference coordination strategies while leveraging the elastic provisioning of data processing resources. It is particularly well suited for dense deployments, such as within a large building where the RAPs are connected ...
متن کاملCentralized asynchronous broadcast in radio networks
We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for...
متن کاملTime efficient centralized gossiping in radio networks
In this paper we study the gossiping problem (all-to-all communication) in radio networks where all nodes are aware of the network topology. We start our presentation with a deterministic gossiping algorithm that works in at most n units of time in any radio network of size n. This algorithm is optimal in the worst case scenario since there exist radio network topologies, such as lines, stars a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2899663